Tag: Data Structures
HashMap
A structure that trades memory for near-constant-time lookup and underpins caches, indexes, and associative containers.
Doubly Linked List
A bidirectional linked structure enabling O(1) insertions and deletions at both ends, with efficient middle operations when node references are known.
Binary Search Tree
A comparison-based tree offering logarithmic operations when balanced, and linear ones when not.
QuickUnion
A near-constant time solution to dynamic connectivity using weighted trees and path compression.
PriorityQueue
A queue optimized for fast access to the highest-priority element.
ArrayList
Classical data structure that is often fast, until it isn't.
Stack
Last In, First Out, simple as that.
UnionFind
A different view on the dynamic connectivity problem through the lens of Quick-Find.
Queue
A practical application of a linked list which shines in scenarios requiring FIFO ordering.
Singly Linked List
The gateway to understanding linked data structures.
Ring Buffer
A ring buffer trades flexibility for predictability — and wins whenever allocations are the bottleneck.